package ShortestPathDemo;

public class Graph {

    int vertexNum;  //顶点数
    int edgeNum; //边数
    Vertex[] vertexArray; //顶点数组

    //-------------------------------------------------//

    public Vertex getVertex(String verName){
        for (int i=0;i<vertexNum;i++){
            if (vertexArray[i].vertexName.equals(verName))
                return vertexArray[i];
        }
        return null;
    }







}
